A Parametric Counterexample Refinement Approach for Robust Timed Specifications
نویسندگان
چکیده
منابع مشابه
Refinement and Consistency of Timed Modal Specifications
In the application domain of component-based system design, developing theories which support compositional reasoning is notoriously challenging. We define timed modal specifications, an automata-based formalism combining modal and timed aspects. As a stepping stone to compositional approaches of timed systems, we define the notions of refinement and consistency, and establish their decidability.
متن کاملAn Abstraction Refinement Technique for Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop
ion Inputs A , h {h = abstraction function} Ŝ := ∅, →̂ := ∅ {M̂ = (Ŝ, ŝ0, →̂)} foreach l ∈ L do Ŝ := Ŝ ∪ {h(l)} end for ŝ0 := h(l0) foreach (l1, a, g, r, l2) ∈ T do →:=→ ∪{(h(l1), h(l2))} end for return M̂
متن کاملTimed Model-based Programming: Executable Specifications for Robust Critical Sequences
For robotic spacecraft, robust plan execution is essential during timecritical mission sequences, due to the very short time available for recovery from anomalies. These sequences include hard-coded delays between certain actions, which implicitly capture knowledge about the state of the spacecraft or its environment. Our goal is to fold the representation of such timing constraints into the mo...
متن کاملA Compositional Approach on Modal Specifications for Timed Systems
On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, time is a crucial aspect of systems for practical applications, e.g. in the area of embedded systems. And yet, only few results exist on the design of timed component-based systems. In this paper, we propose a timed extension o...
متن کاملImplementing Timed Automata Specifications: The "Sandwich" Approach
From a highly distributed timed automata specification, the paper analyses an implementation in the form of a looping controller, launching possibly many tasks in each cycle. Qualitative and quantitative constraints are distinguished on the specification to allow such an implementation, and the analysis of the semantic differences between the specification and the implementation leads to define...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.87.3